Recursive Algorithms for Realization of One- Dimensional Discrete Sine Transform and Inverse Discrete Sine Transform
نویسنده
چکیده
In this paper, novel recursive algorithms for realization of one-dimensional discrete sine transform (DST) and inverse discrete sine transform (IDST) of any length are proposed. By using some mathematical techniques, recursive expressions for DST and IDST have been developed. Then, the DST and IDST are implemented by recursive filter structures. A linear systolic architecture for realization of DST is also presented in this paper. Compared with some other algorithms, the proposed algorithm for DST achieves savings on the number of multiplications and additions. The recursive algorithms have been found very effective for realization using software and VLSI techniques.
منابع مشابه
Recursive Algorithms and Systolic Architectures for Realization of Type-II Discrete Cosine Transform and Inverse Discrete Cosine Transform
The paper presents novel recursive algorithms for realization of one-dimensional type-II discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) of any length. By using some mathematical techniques, recursive expressions for DCT and IDCT have been developed. The number of additions and multiplications in the recursive algorithm for DCT are less in comparison with some other...
متن کاملRadix-2 Algorithms for Implementation of Type-II Discrete Cosine Transform and Discrete Sine Transform
In this paper radix-2 algorithms for computation of type-II discrete cosine transform (DCT) and discrete sine transform (DST) of length N = 2 (n ≥ 2) are presented. The DCT/DST can be computed from two DCT/DST sequences, each of length N/2. The odd-indexed output components of DCT/DST can be realized using simple recursive relations. The proposed algorithms require a reduced number of arithmeti...
متن کاملType-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DSTIV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from 2N log2 N +O(N...
متن کاملUnified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms
The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms are considered. In particular, a new scheme employing the time-recursive approach to compute these transforms is presented. Using such approach, unified parallel lattice structures that can dually generate the DCT an...
متن کاملRestructured recursive DCT and DST algorithms
The discrete cosine transform (DCT) and the discrete sine transform (DST) have found wide applications in speech and image processing, as well as telecommunication signal processing for the purpose of data compression, feature extraction, image reconstruction, and ltering. In this paper, we present new recursive algorithms for the DCT and the DST. The proposed method is based on certain recursi...
متن کامل